package leetcode.weekly.week305;

import leetcode.helper.H;

public class Solution3Test extends H {

	public void debug4(Solution3 so) {
		H.compare(true, so.validPartition(H.str2array3("[676575,676575,676575,533985,533985,40495,40495,40495,40495,40495,40495,40495,782020,782021,782022,782023,782024,782025,782026,782027,782028,782029,782030,782031,782032,782033,782034,782035,782036,782037,782038,782039,782040,378070,378070,378070,378071,378072,378073,378074,378075,378076,378077,378078,378079,378080,378081,378082,378083,378084,378085,378086,378087,378088,378089,378090,378091,378092,378093,129959,129959,129959,129959,129959,129959]")));
		H.compare(true, so.validPartition(H.str2array3("[4,4,4,5,6]")));
		H.compare(false, so.validPartition(H.str2array3("[1,1,1,2]")));
	}

	public void debug3(Solution3 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution3 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution3 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution3Test test = new Solution3Test();
		Solution3 so = new Solution3();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
